Incremental Localization Algorithm Based on Regularized Iteratively Reweighted Least Square
نویسندگان
چکیده
منابع مشابه
An Iteratively Reweighted Least Square Implementation for Face Recognition
We propose, as an alternative to current face recognition paradigms, an algorithm using reweighted l2 minimization, whose recognition rates are not only comparable to the random projection using l1 minimization compressive sensing method of Yang et al [5], but also robust to occlusion. Through numerical experiments, reweighted l2 mirrors the l1 solution [1] even with occlusion. Moreover, we pre...
متن کاملMultiple Task Learning Using Iteratively Reweighted Least Square
Multiple task learning (MTL) is becoming popular due to its theoretical advances and empirical successes. The key idea of MTL is to explore the hidden relationships among multiple tasks to enhance learning performance. Recently, many MTL algorithms have been developed and applied to various problems such as feature selection and kernel learning. However, most existing methods highly relied on c...
متن کاملReweighted nonnegative least-mean-square algorithm
Statistical inference subject to nonnegativity constraints is a frequently occurring problem in signal processing. The nonnegative least-mean-square (NNLMS) algorithm was derived to address such problems in an online way. This algorithm builds on a fixed-point iteration strategy driven by the Karush-Kuhn-Tucker conditions. It was shown to provide low variance estimates, but it however suffers f...
متن کاملA Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares
We present a parallel algorithm for the undirected s-t min-cut problem with floating-point valued weights. Our overarching algorithm uses an iteratively reweighted least squares framework. This generates a sequence of Laplacian linear systems, which we solve using parallel matrix algorithms. Our overall implementation is up to 30-times faster than a serial solver when using 128 cores.
متن کاملImproved Iteratively Reweighted Least Squares for Unconstrained
In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computing and Decision Sciences
سال: 2016
ISSN: 2300-3405
DOI: 10.1515/fcds-2016-0011